package com.aqie.medium.binaryTree;

import com.aqie.easy.structure.TreeNode;

/**
 * 951 翻转等价二叉树
 */
public class FlipEquiv {
    public boolean flipEquiv(TreeNode root1, TreeNode root2) {
        return true;
    }
}
